翻訳と辞書 Words near each other ・ Autodromo di Mores ・ Autodromo di Pergusa ・ Autodromo Enzo e Dino Ferrari ・ Autodromo Internacional de Yahuarcocha ・ Autodromo Nazionale Monza ・ Autodromo Riccardo Paletti ・ Autodrómo Internacional de Las Américas ・ Autoduel ・ Autodynamics ・ Autodyne ・ AutoeBid ・ AUTOECO ・ Autoecology ・ Autoeczematization ・ Autoencoder ・ Autoepistemic logic ・ Autoerotic ・ Autoerotic (film) ・ Autoerotic fatality ・ Autoeroticism ・ Autoethnography ・ Autoette ・ Autoette (1910 automobile) ・ AutoEuropa ・ AUTOEXEC.BAT ・ AutoExpreso ・ Autofac ・ Autofahrer-Rundfunk-Informationssystem ・ Autofeather ・ Autofellatio Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Autoepistemic logic ： ウィキペディア英語版 Autoepistemic logic The autoepistemic logic is a formal logic for the representation and reasoning of knowledge about knowledge. While propositional logic can only express facts, autoepistemic logic can express knowledge and lack of knowledge about facts. The stable model semantics, which is used to give a semantics to logic programming with negation as failure, can be seen as a simplified form of autoepistemic logic. ==Syntax== The syntax of autoepistemic logic extends that of propositional logic by a modal operator $\backslash Box$ indicating knowledge: if $F$ is a formula, $\backslash Box\; F$ indicates that $F$ is known. As a result, $\backslash Box\; \backslash neg\; F$ indicates that $\backslash neg\; F$ is known and $\backslash neg\; \backslash Box\; F$ indicates that $F$ is not known. This syntax is used for allowing reasoning based on knowledge of facts. For example, $\backslash neg\; \backslash Box\; F\; \backslash rightarrow\; \backslash neg\; F$ means that $F$ is assumed false if it is not known to be true. This is a form of negation as failure. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Autoepistemic logic」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.